Multi-level methods and approximating distribution functions
نویسندگان
چکیده
منابع مشابه
Multi-level methods and approximating distribution functions
Biochemical reaction networks are often modelled using discrete-state, continuoustime Markov chains. System statistics of these Markov chains usually cannot be calculated analytically and therefore estimates must be generated via simulation techniques. There is a well documented class of simulation techniques known as exact stochastic simulation algorithms, an example of which is Gillespie’s di...
متن کاملApproximating Conditional Distribution Functions Using Dimension Reduction
Motivated by applications to prediction and forecasting, we suggest methods for approximating the conditional distribution function of a random variable Y given a dependent random d-vector X. The idea is to estimate not the distribution of Y |X, but that of Y |θX, where the unit vector θ is selected so that the approximation is optimal under a least-squares criterion. We show that θ may be esti...
متن کاملApproximating distribution functions by iterated function systems
In this small note an iterated function system on the space of distribution functions is built. The inverse problem is introduced and studied by convex optimization problems. Applications of this method to approximation of distribution functions and estimation are presented. Résumé. Dans cette petite note un système de fonction itéré sur l’espace de fonctions de repartition est construit. Le pr...
متن کاملFinite difference methods for approximating Heaviside functions
We present a finite difference method for discretizing a Heaviside function H(u(~x)), where u is a level set function u : Rn 7→ R that is positive on a bounded region Ω ⊂ R. There are two variants of our algorithm, both of which are adapted from finite difference methods that we proposed for discretizing delta functions in [13–15]. We consider our approximate Heaviside functions as they are use...
متن کاملApproximating the Multi-level Bottleneck Assignment Problem
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book “Assignment Problems” by Burkard et al. (2009) on pages 188 189. One of the applications described there concerns bus driver scheduling. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AIP Advances
سال: 2016
ISSN: 2158-3226
DOI: 10.1063/1.4960118